Polynomial time algorithms for two classes of subgraph problem
نویسندگان
چکیده
منابع مشابه
Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NP -hard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269-302 (1998)] presented the first approximation algorithms for MPS with nontrivial performance ratios. Two algorithms were given, a simple algori...
متن کاملSubgraph Isomorphism in Polynomial Time
In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which di erentiate between graphs that are a priori known, so-called model graphs, and unknown graphs, so-called input graphs. The problem to be solved is to nd a subgraph isomorphism from an input graph, which is given on-line, to any of the model graphs. The new me...
متن کاملPolynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded landscapes. We then used these statistics to study the epistatic structure of MAXSAT problems. These results were dependent on two facts: these functions have a polynomial number of nonzero Walsh coe cients and the coe c...
متن کاملPolynomial-Time formula classes
So far the only method we have to solve the propositional satisfiability problem is to use truth tables, which takes exponential time in the formula size in the worst case. In this lecture we show that for Horn formulas and 2-CNF formulas satisfiability can be decided in polynomial time, whereas for 3-CNF formulas satisfiability is as hard as the general case. We also show that if we replace di...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2008
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2008015